x, y = map(int, input().split())
if y == 0:
print('No')
exit(0)
if y == 1:
if x == 0:
print('Yes')
else:
print('No')
exit(0)
print('Yes' if x >= y - 1 and (x - y + 1) % 2 == 0 else 'No')#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll x,y;
cin>>x>>y;
y=y-1;
if (y > x || (x > 0 && y <= 0))
{
cout << "No" ;
return 0;
}
if((x%2==0 && y%2==0)||(x%2==1 && y%2==1))
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
}
Anagrams | Prime Number |
Lexical Sorting Reloaded | 1514A - Perfectly Imperfect Array |
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |